Checking Overlaps of Nominal Rewriting Rules
نویسندگان
چکیده
Nominal rewriting generalises first-order rewriting by providing support for the specification of binding operators. In this paper, we give sufficient conditions for (local) confluence of closed nominal rewriting theories, based on the analysis of rule overlaps. More precisely, we show that closed nominal rewriting rules where all proper critical pairs are joinable are locally confluent. We also show how to refine the notion of rule overlap to derive confluence of the closed rewriting relation. The conditions that we define are easy to check using a nominal unification algorithm.
منابع مشابه
Critical Pair Analysis in Nominal Rewriting
Nominal rewriting (Fernández, Gabbay & Mackie, 2004; Fernández & Gabbay, 2007) is a framework that extends first-order term rewriting by a binding mechanism based on the nominal approach (Gabbay & Pitts, 2002; Pitts, 2003). In this paper, we investigate confluence properties of nominal rewriting, following the study of orthogonal systems in (Suzuki et al., 2015), but here we treat systems in wh...
متن کاملConfluence of Orthogonal Nominal Rewriting Systems Revisited
Nominal rewriting systems (Fernández, Gabbay & Mackie, 2004; Fernández & Gabbay, 2007) have been introduced as a new framework of higher-order rewriting systems based on the nominal approach (Gabbay & Pitts, 2002; Pitts, 2003), which deals with variable binding via permutations and freshness conditions on atoms. Confluence of orthogonal nominal rewriting systems has been shown in (Fernández & G...
متن کاملA Termination Criterion for Graph Transformations with Negative Application Conditions
Termination of graph transformations is in general undecidable, but it is possible to prove it for specific systems by checking for sufficient conditions. In the presence of rules with negative application conditions, the difficulties increase. In this paper we propose a different approach to the identification of a (sufficient) criterion for termination, based on the construction of a labelled...
متن کاملFrom nominal to higher-order rewriting and back again
We present a translation function from nominal rewriting systems (NRSs) to combinatory reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation. We also provide a reduction-preserving translation in the other direction, from CRSs to NRSs, improving over a previously defined translation. Th...
متن کاملTermination of String Rewriting Rules That Have One Pair of Overlaps
This paper presents a partial solution to the long standing open problem of termination of one rule string rewriting Overlaps between the two sides of the rule play a central role in existing termination criteria We characterize termination of all one rule string rewriting systems that have one such overlap at either end This both completes a result of Kurth and generalizes a result of Shikishi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 323 شماره
صفحات -
تاریخ انتشار 2016